Complete Monotone Quasiconcave Duality

نویسندگان

  • Simone Cerreia-Vioglio
  • Fabio Maccheroni
  • Massimo Marinacci
  • Luigi Montrucchio
چکیده

We introduce a notion of complete monotone quasiconcave duality and we show that it holds for important classes of quasiconcave functions. JEL classification: C65

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Duality between quasi-concave functions and monotone linkage functions

A function F defined on all subsets of a finite ground set E is quasiconcave if F (X∪Y ) ≥ min{F (X), F (Y )} for all X, Y ⊂ E. Quasi-concave functions arise in many fields of mathematics and computer science such as social choice, theory of graph, data mining, clustering and other fields. The maximization of quasi-concave function takes, in general, exponential time. However, if a quasi-concav...

متن کامل

Monotone and Local Potential Maximizers in Symmetric 3× 3 Supermodular Games∗

Generalized notions of potential maximizer, monotone potential maximizer (MP-maximizer) and local potential maximizer (LPmaximizer), are studied. It is known that 2 × 2 coordination games generically have a potential maximizer, while symmetric 4 × 4 supermodular games may have no MPor LP-maximizer. This note considers the case inbetween, namely the class of (generic) symmetric 3 × 3 supermodula...

متن کامل

DUALITY IN VECTOR OPTIMIZATION Part I. Abstract Duality Scheme

This is a contribution to the duality theory in optimization theory. A unified approach is presented. The paper is divided into three parts. In the first part an abstract duality scheme is formulated and studied. The well-known duality principles are formulated and proved for this model, too. The second part studies the dual problems in the vector quasiconcave programming. The last part is devo...

متن کامل

Algebraic duality for partially ordered sets

For an arbitrary partially ordered set P its dual P ∗ is built as the collection of all monotone mappings P → 2 where 2 = {0, 1} with 0 < 1. The set of mappings P ∗ is proved to be a complete lattice with respect to the pointwise partial order. The second dual P ∗∗ is built as the collection of all morphisms of complete lattices P ∗ → 2 preserving universal bounds. Then it is proved that the pa...

متن کامل

Some results on $L$-complete lattices

The paper deals with special types of $L$-ordered sets, $L$-fuzzy complete lattices, and fuzzy directed complete posets.First, a theorem for constructing monotone maps is proved, a characterization for monotone maps on an $L$-fuzzy complete lattice is obtained, and it's proved that if $f$ is a monotone map on an $L$-fuzzy complete lattice $(P;e)$, then the least fixpoint of $f$ is meet of a spe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Math. Oper. Res.

دوره 36  شماره 

صفحات  -

تاریخ انتشار 2011